package total;

import java.util.Scanner;

public class Ques1460 {
	
	public void mergeSort(int[] arr,int n){
		this.mergeSort(arr,0,n-1);
	}
	
	private void mergeSort(int[] arr,int l,int r){
		
		if(l >= r)return;
		
		int mid = (l + r)/2;
		this.mergeSort(arr,l,mid);
		this.mergeSort(arr,mid+1,r);
		if(arr[mid] > arr[mid + 1])
			this.merge(arr,l,mid,r);
	}
	
	private void merge(int[] arr,int l,int mid,int r){
		int[] temp = new int[r - l + 1];
		for(int i = l;i <= r; i++){
			temp[i - l] = arr[i];
		}
		
		int i = l,j = mid + 1;
		
		for(int k = l;k <=r;k ++){
			if(i > mid){
				arr[k] = temp[j - l];
				j++;
			}else if(j > r){
				arr[k] = temp[i - l];
				i++;
			}else if(temp[i - l] < temp[j -l]){
				arr[k] = temp[i-l];
				i ++;
			}else{
				arr[k] = temp[j - l];
				j ++;
			}
		}
	}
	
	public void go(){
		Scanner scan = new Scanner(System.in);
		int T = scan.nextInt();
		int n;
		int[] arr;
		int a,b,c;
		outter:while(T-- > 0){
			n = scan.nextInt();
			arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = scan.nextInt();
			}
			this.mergeSort(arr, n);
			a = arr[0];
			b = arr[n - 1];
			c = arr[1];
			if(b * b - 4*a*c >= 0){
				System.out.println(a+" "+b+" "+c);
				continue outter;
			}else{
				System.out.println("impossible");
			}
		}
	}
	
	public static void main(String[] args) {
		new Ques1460().go();
	}
}
